完全非线性函数的原像分布特征

完全非线性函数在密码设计与分析中具有十分重要的作用.利用代数数论的方法,研究一般有限Abel群上完全非线性函数的原像分布特征,给出了一般有限Abel群上完全非线性函数存在的一个必要条件,证明了某些群上不存在完全非线性函数,得到了素数域上完全非线性函数的原像分布.     

Lipschitz非线性系统状态观测器设计新方法

针对Lipschitz非线性系统状态观测器,提出了一种以极小化条件数为目标准则的新的设计方法。运用梯度下降法和Slyvester方程,计算极小化条件数,优化增益矩阵和最大允许Lipschitz常数,完成观测器设计。通过同其它文献的算例比较,结果发现按文中方法设计的观测器具有迭代次数少、优化结果好的特点。     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

多操纵面战斗机飞行控制系统设计

现代多操纵面战斗机飞行控制系统多采用非线性控制方法进行设计,其中逆系统方法具有物理概念清晰、参数对应明确、无不确定性算法、容易结合传统经验等优点,易于工程实现.将该方法应用于多操纵面战斗机的基本控制律设计,使用多层简化设计,改进了多操纵面的控制分配策略,并针对某型多操纵面战斗机六自由度模型进行数字仿真,效果良好.     

VB程序设计课程教学的探索与实践

实践表明，对影响VB程序设计课程教学中存在的突出问题进行认真分析，充分利用网络教学平台，改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣，提高学生的编程能力，同时也有助于提高教学质量和效果。     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于灰色非线性回归模型的故障预测

为克服传统灰色模型的局限性,通过对一阶累加生成序列规律性的分析,将灰色模型和非线性回归模型相结合,构造了一种灰色非线性回归模型。实例仿真结果表明,该模型既拓展了传统灰色模型的适用条件,又比传统灰色模型和非线性回归模型具有更高的预测精度,且适用性广。     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Volterra级数模型的非线性压缩测量辨识算法

针对非线性系统的辨识问题,提出了非线性压缩测量辨识算法,且推导出了一种符合压缩感知测量准则的测量模型。相比递归最小二乘法,该方法极大地减少了所需的测量数,使得高阶Volterra级数辨识成为可能。此外,还分析了实际应用中的各项因素对辨识准确性的影响,如信号稀疏度、测量噪声、测量矩阵形式等。